One-sided random context grammars with a limited number of right random context rules
نویسندگان
چکیده
منابع مشابه
Random context tree grammars and tree transducers
Regular tree grammars and top-down tree transducers are extended by random context sensitivity as known from the areas of string and picture generation. First results regarding the generative power of the resulting devices are presented. In particular, we investigate the path languages of random context tree languages. Copyright c © 2005 UMINF 05.02 ISSN 0348-0542
متن کاملMultiset random context grammars, checkers, and transducers
1 Microsoft Research, University of Trento Centre for Computational and Systems Biology Trento, Italy [email protected] 2 Faculty of Informatics Vienna University of Technology Favoritenstr. 9–11, A–1040 Vienna, Austria {rudi,marion}@emcc.at 3 Department of Computer Science and Artificial Intelligence University of Sevilla, Av. Reina Mercedes, 41012, Sevilla, Spain 4 Departmen...
متن کاملA note on one-sided context-sensitive grammars
In this note it is proved that so called one-sided context-sensitive grammars can generate languages which cannot be generated by any context-free grammar. This fact is not quite new. It has been proved in [3], [4] and [5] (as far as the author knows). In [3] it is proved that a special one-sided context-sensitive grammar suggested by Dr. Fris ([1]) generates a language {a m b'"c"; Hn^ m} which...
متن کاملAn extension of context-free grammars with one-sided context specifications
The paper introduces an extension of context-free grammars equipped with a quantifier for referring to the left context, in which the substring being defined does occur. For example, a rule A→ a& B defines a string a, as long as it is preceded by any string defined by B. The conjunction operator in this example is taken from conjunctive grammars (Okhotin, 2001), which are an extension of the st...
متن کاملCooperating Distributed Grammar Systems with Random Context Grammars as Components
In this paper, we discuss cooperating distributed grammar systems where components are (variants of) random context grammars. We give an overview of known results and open problems, and prove some further results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.009